Small surface trades in triangular embeddings
نویسندگان
چکیده
We enumerate all possible trades which involve up to six faces of the face set of a triangular embedding of a simple connected graph. These are classified by the underlying combinatorial trade on the associated block design, and by the geometrical arrangement of the faces necessary to avoid creation of a pseudosurface in the trading operation. The relationship of each of these trades to surface orientability is also established.
منابع مشابه
Triangular embeddings of complete graphs
In this paper we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable triangular embeddings of K12 were found in 1996 by Altshuler, Bokowski and Schuchert, and K13 has no orientable triangular embeddings.) There are 182, 200 nonisomorphic nonorientable triangular embeddings for K12, and 243, 088, 286 for K13. Tri...
متن کاملOriented matroids and complete-graph embeddings on surfaces
We provide a link between topological graph theory and pseudoline arrangements from the theory of oriented matroids. We investigate and generalize a function f that assigns to each simple pseudoline arrangement with an even number of elements a pair of complete-graph embeddings on a surface. Each element of the pair keeps the information of the oriented matroid we started with. We call a simple...
متن کاملA lower bound for the number of orientable triangular embeddings of some complete graphs
We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable triangular embeddings of the complete graph Kn in an orientable surface is at least nan 2 . AMS classification: 05B07, 05C10.
متن کاملSurface embeddings of Steiner triple systems
A Steiner triple system of order n (STS(n)) is said to be embeddable in an orientable surface if there is an orientable embedding of the complete graph Kn whose faces can be properly 2-coloured (say, black and white) in such a way that all black faces are triangles and these are precisely the blocks of the STS(n). If, in addition, all white faces are triangular, then the collection of all white...
متن کاملOn the maximal distance between triangular embeddings of a complete graph
The distance d(f, f ′) between two triangular embeddings f and f ′ of a complete graph is the minimal number t such that we can replace t faces in f by t new faces to obtain a triangular embedding isomorphic to f ′. We consider the problem of determining the maximum value of d(f, f ′) as f and f ′ range over all triangular embeddings of a complete graph. The following theorem is proved: for eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006